Self-adjusted regularization ratio for Robust Compressed Sensing
نویسندگان
چکیده
Introduction Minimizing the total Variation (TV) norm term in conjunction with a fidelity term has been effectively applied to Magnetic Resonance (MR) image reconstruction with partially acquired data [1, 3]. However, an inappropriate ratio, determined by the regularization parameter, between these two terms may result in either residual artifact or reduced spatial resolution. The optimization of the predefined regularization parameter is not trivial. This work aims to make this framework more robust to the choice of the regularization parameter. A self-adjustment technique is proposed in this work to automatically optimize the ratio between these two terms. Using compressed sensing (CS) [1] as an example, experiments with both phantom and in vivo data sets demonstrated that the proposed method made the regularized reconstruction framework less sensitive to the choice of regularization parameter. This work dramatically reduces the difficulty of parameter decision and increases the practicability of regularized reconstruction techniques. Theory Let X be the partially acquired MR data; I be the reconstructed image; Ω be the image domain; ∇ be the gradient operator; MR(·) be MR
منابع مشابه
Image reconstruction with locally adaptive sparsity and nonlocal robust regularization
Sparse representation based modeling has been successfully used in many image-related inverse problems such as deblurring, super-resolution and compressive sensing. The heart of sparse representations lies on how to find a space (spanned by a dictionary of atoms) where the local image patch exhibits high sparsity and how to determine the image local sparsity. To identify the locally varying spa...
متن کاملRobust Fuzzy Content Based Regularization Technique in Super Resolution Imaging
Super-resolution (SR) aims to overcome the ill-posed conditions of image acquisition. SR facilitates scene recognition from low-resolution image(s). Generally assumes that high and low resolution images share similar intrinsic geometries. Various approaches have tried to aggregate the informative details of multiple low-resolution images into a high-resolution one. In this paper, we present a n...
متن کاملRobustness to unknown error in sparse regularization
Quadratically-constrained basis pursuit has become a popular device in sparse regularization; in particular, in the context of compressed sensing. However, the majority of theoretical error estimates for this regularizer assume an a priori bound on the noise level, which is usually lacking in practice. In this paper, we develop stability and robustness estimates which remove this assumption. Fi...
متن کاملRobust reconstruction algorithm for compressed sensing in Gaussian noise environment using orthogonal matching pursuit with partially known support and random subsampling
The compressed signal in compressed sensing (CS) may be corrupted by noise during transmission. The effect of Gaussian noise can be reduced by averaging, hence a robust reconstruction method using compressed signal ensemble from one compressed signal is proposed. The compressed signal is subsampled for L times to create the ensemble of L compressed signals. Orthogonal matching pursuit with part...
متن کاملAn Efficient Algorithm For Total Variation Regularization with Applications to the Single Pixel Camera and Compressive Sensing
An Efficient Algorithm For Total Variation Regularization with Applications to the Single Pixel Camera and Compressive Sensing
متن کامل